Systems and methods for automated internet-based auctions

ABSTRACT

The present invention relates to systems and methods for implementing an automated auction process that is held at a designated time on the Internet, and that ends after bidding has been completed. In accordance with these systems and methods, a server connected to a plurality of workstations may establish several auctions that allow for efficient trading of multiple goods, while simulating the live and dynamic setting of traditional auctions.

This application claims the benefit of U.S. provisional patent application No. 60/459,834, filed Mar. 31, 2003.

BACKGROUND OF THE INVENTION

The present invention relates to systems and methods for implementing automated auction processes that may be conducted electronically.

There have been many different approaches adopted to fairly bring buyers and sellers together in a manner that is economically efficient. A main objective of such approaches is to allow transactions to be conducted as close as possible to the market price of the goods. Generally, the market price can be achieved by permitting full access to the transaction by essentially all potential educated buyers and sellers. However, the buyer/seller transaction must be structured to operate at a very low cost, or it will distort the price of goods. Therefore, some key elements in promoting effective buyer/seller transactions may conflict, thereby necessitating trade-offs between trading efficiency and market knowledge.

An auction is a well known method that brings buyers and sellers together in transacting a sale of goods. Traditionally, this process has involved the gathering of potential buyers in one location, known as an auction house, where select goods are presented to them by an auctioneer that calls for bids. At the floor of an auction, potential buyers compete for an auctioned item by bidding for it, sometimes with the assistance of bid spotters. The auctioned item is sold to the highest bidder once the auctioneer bangs a gavel—i.e., once the hammer falls. Afterwards, an auction attendant assists the winning bidder with the required formalities and the auction house assists in collecting the item the bidder has won, thereby completing the transaction.

Although successful in creating an exciting forum wherein interested parties compete for an item, the traditional auction process suffers from various disadvantages. Participants must be physically assembled at an auction site. Attending an auction is therefore not only time consuming but also expensive, as it may be associated with transportation costs. As a result, fewer buyers may attend and the true market price of the auctioned item may not be achieved.

In an effort to make auctions more convenient, some auction houses allow potential buyers or bidders to submit their bids over the telephone or the Internet, so that they need not be physically present at a particular auction house. Moreover, such bids may be placed in advance—i.e., bidders need not submit their bids while the auction is taking place. By allowing bidders to submit their maximum bids via telephone, mail, facsimile or email, the process of bidding becomes less expensive and may save time. However, such a process may hinder a bidder's ability to increase his or her bid in response to competitive bids received from the floor as it also takes away from the excitement of being physically present at the auction. Not only do the limitations of the previous auction schemes lead to lower selling prices, but they also require the presence of a live auctioneer to conduct the auction.

More recently, Internet-based auctions have been made possible where sellers post descriptions and pictures of items they intend to sell, while buyers browse through such items and enter bids electronically. Such a scheme is particularly useful when there are no established trading locations for the select items. In addition, most Internet-based auctions are automated in that they do not require the presence of a live auctioneer. Compared to traditional auctions that have been the dominant trading form for exotic items such as rare pieces of art, antiques and the like, electronic auctions not only allow for a significant number of users to participate in the auctioning of a good, but may also be used for trading almost all kinds of goods. Moreover, Internet-based auctions allow for multiple users to bid for or sell multiple items substantially simultaneously.

In Internet-based auctions, bidding for a specific item typically starts when the item is posted by a seller and ends at a predetermined time. Bidders are permitted to bid up to the designated end time, where the winning bid is the highest bid at such time. In such a process, bidders often struggle to outbid each other close to the designated end time of the auction. As a result, processing errors or delays may occur, certain bids may not be entered, and the true market price of the auctioned item may not be achieved. Moreover, this type of auction may also lack an element of excitement that is present throughout a traditional auction.

A reverse auction is a variation of the auction process that may be used in Internet-based auctions. At the start of such a process, the price of the auctioned item is set at a predetermined value and decreases in predetermined decrements during the auction. Such a process typically takes place over a relatively short period of time during which each potential buyer is provided with the current price and the time remaining until the auction is concluded. Although more exciting and dynamic than typical Internet-based auctions, reverse auctions are associated with large activity as the auction nears its conclusion. This again may lead to the item selling at a sub-optimal price and may increase the risk of processing errors.

It would therefore be desirable to provide automated Internet-based auction systems and methods that allow for efficient and simultaneous trading of multiple goods, while simulating the live and dynamic setting of a traditional auction.

SUMMARY OF THE INVENTION

It is an object of this invention to provide automated auction systems and methods that may be implemented on the Internet.

It is another object of this invention to provide automated auction systems and methods that allow for multiple participants to trade multiple items substantially simultaneously and at low costs.

It is still another object of this invention to provide automated auction systems and methods that result in the trading of items at optimal prices while incurring the least possible number of errors.

It is yet another object of this invention to provide automated auction systems and methods that simulate the live and dynamic setting of a traditional auction, while still allowing participants to submit advance bids.

The above and other objects of the present invention are preferably realized in a computer-based processing system for implementing several auction processes that may be each held at an auction site on the Internet at a designated time and date. A sample auction process may control and display an animated automated character in the role of an auctioneer. Product information relating to an item or group of items being auctioned may also be displayed. After the animated auctioneer announces the start of the auction, the auction process may receive bids from multiple bidders participating in the auctioning of the item(s). The animated auctioneer may continue to announce the current bid based on the received bids until bidding appears to have stopped by virtue of the fact that there have been no additional bids after the expiration of a pre-determined amount of time from the last bid.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects and advantages of the invention will be apparent upon consideration of the following detailed description, taken in conjunction with the accompanying drawings, in which like reference characters refer to like parts throughout, and in which:

FIG. 1 is a block diagram of a system that may be used to implement the processes and functions of certain embodiments of the present invention;

FIG. 2 is a preferred flow diagram of a process that may be used to establish or enter an auction in accordance with certain embodiments of the present invention;

FIG. 3 is an illustration of an exemplary screen that may be displayed upon the entering of the auction process in accordance with certain embodiments of the present invention;

FIG. 4 is a preferred flow diagram of a process that may be used in the execution of an auction in accordance with certain embodiments of the present invention;

FIG. 5 is an illustration of an exemplary interactive screen that may be displayed during the auction process in accordance with certain embodiments of the present invention;

FIG. 6 is an illustration of another exemplary interactive screen that may be displayed during the auction process in accordance with certain embodiments of the present invention;

FIG. 7 is an illustration of an exemplary interactive screen that may be displayed after the conclusion of the auction process in accordance with certain embodiments of the present invention;

FIG. 8 is an illustration of another exemplary interactive screen that may be displayed after the conclusion of the auction process in accordance with certain embodiments of the present invention; and

FIG. 9 is another flow diagram of a process that may be used in the execution of an auction in accordance with certain embodiments of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention is directed to methods for implementing an automated auction process that may be conducted electronically. Potential sellers may enter one or more items to be auctioned. Once the auction for a specific item or group of items is held, potential buyers may bid on such items. Animated automated characters may be displayed to auction participants and play the role of an auctioneer, a bid spotter and an auction attendant in conducting the automated auction preferably on the Internet.

The present invention is also directed to systems for implementing the automated auction process. The first aspect of such systems relates to a hardware arrangement that may provide a platform for buyers and sellers to participate in the auction process and display the auctioned items as well as the animated characters conducting the auction. The second aspect of the systems relates to a governing logic that is stored in the system memory and that may provide a sequence of protocols and rules that control the auction process and the animated characters.

Referring to FIG. 1, exemplary system 100 for implementing the present invention is shown. As illustrated, system 100 may include one or more workstations 110. Workstations 110 may be local or remote, and are connected by one or more communications links 102 to computer network 103 that is linked via communications link 105 to server 120.

Server 120 may be any suitable server, processor, computer, data processing device, or combination of the same. Server 120 may be used to implement the governing logic that runs the auction process. Computer network 103 preferably includes the Internet but may consist of any suitable computer network such as an intranet, a wide-area network (WAN), a local-area network (LAN), a wireless network, a digital subscriber line (DSL) network, a frame relay network, an asynchronous transfer mode (ATM) network, a virtual private network (VPN), or any combination of the same. Communications links 102 and 105 may be any communications links suitable for communicating data between workstations 110 and server 120, such as network links, dial-up links, wireless links, hard-wired links, etc.

Workstations 110 may be personal computers, laptop computers, mainframe computers, dumb terminals, data displays, Internet browsers, Personal Digital Assistants (PDAs), two-way pagers, wireless terminals, portable telephones, etc., or any combination of the same. Workstations 110 may be used by participants to post items for sale or to enter into and proceed with the auctioning of such items.

A typical workstation 110 may include processor 111, display 112, input device 113, and memory 114, which may be interconnected. In a preferred embodiment, memory 114 contains a storage device for storing a workstation program for controlling processor 111. Input device 113 may be used by potential buyers to enter bids on desired items, or by potential sellers to post items they intend to sell. Processor 111 may use the workstation program to receive product and sale information relating to the auctioned item, and present on display 112 auction information such as the current highest bid, the minimum acceptable opening bid, the minimum acceptable incremental, the auction commencement time and/or the length of time that has passed since the beginning of the auction. Display 112 may also be used to exhibit animated auctioneers, animated bid spotters and/or auction attendants to participants when appropriate.

Server 120, which may be maintained by an auction host, may include processor 121, display 122, input device 123, and memory 124, which may be interconnected. In a preferred embodiment, memory 124 contains a storage device for storing auction information and user information as well as a server program that provides the governing logic for controlling processor 121. Processor 121 may use the server program to establish auctions for specific items, allow participants to partake in the auction, sort and accept bids on such items, enter bids on behalf of potential bidders and automatically control several aspects of the electronic auctions. Processor 121 further creates and controls the automated auctioneers, bid spotters and auction attendants pertaining to the various auctions.

In a preferred embodiment of the present invention, the auction may take place on the Internet's World Wide Web at an auction site maintained by the auction host, as described and shown in FIGS. 2-9. These figures describe processes and illustrate screens that may be implemented by and displayed on system 100 of FIG. 1, in accordance with the principles of the present invention.

FIG. 2 partly describes a process 200 by which an auction is created for an item posted by a potential seller. At step 202 of process 200, a potential seller may access the online auction site through workstation 110 of FIG. 1. She may then be prompted for a username and password at step 204. The seller may then enter the required information which is communicated to server 120 of FIG. 1. At step 206, a determination is made as to whether the entered username and password are valid. If the verification process is unsuccessful, the seller may be denied access at step 208. If the verification process is successful, her profile may be retrieved. She may then proceed to step 210 where she may indicate that she intends to sell an item by, for example, clicking on an appropriate link on the site.

After step 210, the seller may be directed to enter information relating to the item or items she wishes to sell at step 212. Such item or product information may include categorical classification, item description, photographs or video presentation of the items or a sample item, units of the item available for sale, etc. The seller may also be directed to enter certain information relating to the sale or delivery of the item(s) at step 212. Such sale information may include the preferred payment method, the preferred auction duration and commencement time, the seller's reserve price (if any), etc.

Once the seller enters the required information, the entered information may be communicated from workstation 110 to server 120 of FIG. 1. The information may then be automatically processed and one or more auction numbers, date and time for the sale of the item(s) are assigned at step 214 of FIG. 2. The assigning of an auction date and time may be based on a preset number of days, the seller's preferences, the nature of the item(s) being sold, the expected selling price(s) of the item(s) and/or the auction times assigned to other items. Because each auction is an automated process that may be implemented on networked terminals, multiple auctions for different items may be scheduled to start or run at the same time.

The minimum acceptable opening bid and the minimum acceptable incremental bid may also be determined at step 214. Alternatively, they may be determined at some other time before the start of the auction or at the start of the auction, based on the nature, expected selling price or value of the item(s) being auctioned, or based on the reserve price (if any) entered by the seller. The minimum acceptable incremental bid may also change as a function of the current bid during the auction. Confirmation of the setting of the auction date and time along with other auction information may be displayed or communicated to the seller at step 216. The seller may also be notified of the upcoming auction via email some time prior to the commencement of the auction.

Process 200 may also be used by a potential buyer in order to participate in an already established auction. A potential buyer may undergo steps 202, 204 and 206 of process 200 as well, according to the preferred embodiment of the present invention described in FIG. 2. This embodiment obviates the need for multiple access points to the auction site. If a potential buyer accesses the auction site in order to enter an auction or search for particular items being auctioned, he may enter a username and password, and proceed to step 218, where he may enter a search for an item scheduled for auction or an item being auctioned. The search may be based on a pre-assigned auction number, an item description, a general or specific category query, etc.

At step 220, the potential buyer may be queried as to whether he would like to enter a particular auction once he views search results by an animated auction attendant, such as the one described in connection with FIG. 3. If he does not choose to enter or if the auctioned item is not available either because bidding has been closed or has not been opened, the auction attendant may be automatically adapted to thank him for visiting the site and wish him goodbye at step 222. The potential buyer may alternatively conduct additional searches or as many searches as he may please. In addition, system 100 of FIG. 1 may be automatically adapted to conduct searches at step 218 of FIG. 2 on items available for auction based on the potential buyer's previous purchases and/or items in which he has demonstrated interest, as stored in the system memory in accordance with his profile.

If the potential buyer chooses to enter an available auction, the system may determine whether the auction has commenced at step 224. If the particular auction has not yet begun but is about to start, the process may continue to step 402 in FIG. 4 or FIG. 9. If the auction has begun, the process may continue to step 406 in FIG. 4 or FIG. 9. In either case, a screen such as exemplary screen 300 shown in FIG. 3 may be displayed to the buyer.

FIG. 3 illustrates an exemplary screen that the auction system may display to the potential buyer entering a particular auction on workstation 110 of FIG. 1. Screen 300 may include an animated character in the form of an auction attendant 311 welcoming the potential buyer to virtual auction room 310. Auction attendant 311 is automated and controlled by the controlling logic of system 100 depicted in FIG. 1. Auction attendant 311 of FIG. 3 may be adapted to welcome the potential buyer through the announcement made in window 302. Screen 500 of FIG. 5 may then be displayed to the potential buyer, following screen 300.

An auction attendant in the form of character 311 of FIG. 3 may be the default auction attendant that is displayed to the potential buyer entering an auction. Alternatively, the auction attendants of FIGS. 3 and 7, along with the bid spotter and auctioneer of FIG. 5, may be any animated characters that system 100 may generate based on the potential buyer's preferences, the potential buyer's profile or based on the item(s) being auctioned. For example, the auction attendant may be selected from a pre-configured set of genre-based characters. The auction attendant may be in the form of a man or a woman pertaining to a certain age group and having a certain demeanor. Alternatively, the auction attendant may be a cartoon character or a character having the likeness of a famous personality or celebrity.

In the preferred embodiment illustrated in FIGS. 2 and 3, only registered users may participate in the auction process. Such registered users may be notified via email about the various auctions that are scheduled to take place and about specific auctions in which they have demonstrated interest. Such information may be stored in the system memory as part of their user profiles.

An unregistered participant who wishes to access the auction and who does not have a username or password may be prompted to create an account with the auction house hosting the site if he so desires. Such a process may require him to pay a fee and disclose certain user-related information that may be used to create a user profile. Alternatively, the process of creating a user account may be free-of charge. This may apply to both potential sellers and buyers. In addition to assigning a potential buyer a username and a password, the process of creating an account may involve receiving a shipping address and a preferred payment method that may be stored in the system memory, as part of the user profile. In addition, the buyer may select the animated characters he would like to have appear as discussed in relation to FIGS. 3, 5 and 7. Similarly, the process of creating an account for a potential seller may involve receiving a preferred payment method and other information that may be stored in the system memory as well. Account and profile information may be stored in the system memory, such as memory 124 of FIG. 1.

In another embodiment of the present invention designed to attract potential participants, users may access the auction site and not be prompted to enter a username or a password until they decide to either post an item for sale or enter a bid on an auction. In yet another embodiment of the present invention, unregistered users may access the auction site in order to buy certain items and need not undergo any of steps 202, 204 or 206 of FIG. 2. In that case, process 200 may start at step 218. In such an embodiment, only a potential seller may be prompted for a username and a password. In such an embodiment, steps 204 and 206 need not take place prior to step 210.

FIG. 4 describes a preferred process 400 that governs an automated auction. FIG. 5 illustrates an exemplary screen that the auction system may display to potential buyers or bidders on workstation 110 of FIG. 1, while the auction is taking place. Different portions of the screen displayed in FIG. 5 may change as process 400 of FIG. 4 goes from one step to another. Participants who attempt to enter the auction at or right before the auction starting time may be allowed to enter the auction prior to the occurrence of step 402 of process 400, as indicated by the arrow from step 224 of process 200, in the event that the answer to the question of step 224 of FIG. 2 was in the negative. The auctioning of a particular item or group of items may start at step 402 of process 400 at the time and date designated at step 214 of FIG. 2. At that time, screen 500 of FIG. 5 may be displayed to each potential buyer participating in the auction.

Screen 500 of FIG. 5 may include window 504 that displays a picture of the item or a sample item being auctioned as well as a brief description of the item. Screen 500 may display the current time and date in region 502, the auction number in window 550, and may include window 510. Window 510 may display the current highest bid in region 512, the current number of units of the item that are available for auction in region 514, and the length of time that has passed since the start of the auction in region 516. Screen 500 is interactive in that it may contain buttons 540 that enable participants to, for example, place a bid via Bid button 544 or Smart Bid button 545, retract a bid via Retract button 546, query for help via Help button 548 or for more information about the product via Product Information button 542. Screen 500 may be updated as different parameters, such as the highest bid price and the units available, change as the auction proceeds. Screen 500 may also include Exit Auction button 560 that allows the potential buyer to exit from the particular auction and that conceals screen 500 upon confirmation.

Screen 500 may also include window 520 that displays an animated character in the form of an auctioneer 522 presiding over the auction behind table 524, and holding gavel or hammer 526. Auctioneer 522 is automated and controlled by the controlling logic of system 100 depicted in FIG. 1. An auctioneer in the form of the character 522 may be the default character that is displayed to the potential buyer. Alternatively, the auctioneer may be any animated character that system 100 may generate based on the potential buyer's preferences, profile or on the item(s) being auctioned.

At the start of the auction, auctioneer 522 of FIG. 5 may announce that the auction has started. Like all subsequent announcements made by auctioneer 522, such an announcement may be heard through the workstation speakers utilized by every participant and may be displayed in region 528 of window 520 to every participant. Auctioneer 522 may also announce the item(s) being sold, the minimum acceptable opening bid and the minimum acceptable incremental bid thereafter, as determined at step 214 of FIG. 2. In addition, auctioneer 522 may announce whether the auction is a reserve auction as well as other relevant rules pertaining to the auction. Such rules may be accessed by a bidder at any time during the auction process by pressing on Help button 548.

Screen 500 of FIG. 5 may also display an animated character in the form of a bid spotter 533 that may appear once the auction starts at step 402 of FIG. 4, or later during the auction at step 406 of FIG. 4. Bid spotter 533 is automated and controlled by the controlling logic of system 100 depicted in FIG. 1. A bid spotter in the form of the character 533 may be the default character that is displayed to the potential buyer. Alternatively, the bid spotter may be any animated character that system 100 of FIG. 1 may generate based on the potential buyer's preferences, profile or on the item(s) being auctioned. Bid spotter 533 of FIG. 5 may solicit bids and make announcements at various stages of the auction as described below. Such announcements be heard through the workstation speakers of a particular participant entering a bid and may be displayed in region 538 of screen 500 to that same participant. In an alternative embodiment, auctioneer 522 may perform some or all the functions of a bid spotter instead of bid spotter 533.

Referring back to process 400 of FIG. 4, after the auction has started at step 402, a pre-determined time period during which bids may be accepted is calculated at step 404. The pre-determined time period, which may be also known as the bidding period, may be calculated based on the current highest bid, the minimum acceptable opening bid, the minimum acceptable incremental bid and/or the number of current participants. The bidding period may be updated at different stages of the auction based on the amount of bidding activity—i.e., the number of received bids, the previously calculated bidding period, and whether announcement “Going Once” or “Going Twice” was made, as described below. In addition, a timer may be set for counting down the bidding period at step 404. The expiration of the timer may indicate that bidding has stopped either because no successful bid was established, or because no higher bid was entered.

Participants who have not entered the auction at the auction starting time may be allowed to enter the auction after step 404 of process 400, as indicated by the arrow from step 224 of process 200, in the event that the answer to the question of step 224 of FIG. 2 was in the positive. Potential buyers who do not participate in the auction at the time it is held may submit advance bids prior to the auction starting time.

An advance bid may be the highest amount of money a potential buyer is willing to pay for the item being auctioned. The potential buyer may have the option of submitting his advance bid as a Smart Bid. In doing so, the potential buyer may specify a level of improvement he wishes to have applied. If the user does not specify the level of improvement, his bid may be assigned a default improvement level. The improvement level may be implemented as described in co-pending commonly assigned U.S. patent application Ser. No. 10/171,009, filed Jun. 11, 2002 and provisional patent application Ser. No. 60/463,835 filed Apr. 16, 2003, which are hereby incorporated by reference herein in their entireties.

At step 406 of FIG. 4, process 400 may receive and arrange bids entered by various buyers. Bid spotter 533 of FIG. 5 may solicit individual participants as described below, and may announce the bid entered by a particular participant to auctioneer 522 as a form of confirmation to the participant that his bid was entered and received. This announcement may be audible to and readable by the participant placing the bid. In the event that advance bids have been submitted by potential buyers, they may also be received at step 406 of FIG. 4.

Each received bid may be registered based on the bidder who entered it, the amount it is for, the time it was entered, and/or whether it is an advance bid. Each bid may also be validated—e.g., the system may check whether the bid is over the sum of the minimum acceptable incremental bid and the most recent current highest bid. In the event that two or more bids are equal in amount, the bid that was received first may be given higher priority.

Advance bids may be modified and placed at the next allowable bid amount, up to the maximum amount authorized by the bidder. The next allowable bid amount may be calculated by adding the minimum acceptable incremental bid to the current highest bid. In the event the bidder submitted an advance bid under the Smart Bid option, his bid may be modified and placed at a higher bid amount, without exceeding the maximum amount authorized by the bidder. The higher bid amount may be calculated by multiplying the minimum acceptable incremental bid by a variable factor, and adding the result to the current highest bid. The factor may be chosen based on the improvement level selected by the bidder, the current highest bid and/or the maximum amount authorized by the bidder. Alternatively, the advance bid may be modified under the Smart Bid option in any other way that ensures that the highest amount the advance bidder is willing to pay for the item is entered as a valid bid by the system.

In the event that an advance bid is equal to the highest bid entered by a participant, the advance bid may or may not be given priority over that highest bid. In the event that two or more advance bids are equal in amount, the bid that was entered first may be given higher priority. Alternatively, in the event that two or more bids are equal in amount, the bid entered by the more established bidder—i.e., the user who has placed more bids, placed bids on more items, participated in more auctions, etc.—may be given higher priority.

In order for a potential buyer participating in the auction to place a bid on the item(s) being auctioned, he may press Bid button 544. His bid may be placed at the next allowable bid amount based on the minimum acceptable incremental bid, or may be received as entered by the bidder through his keyboard. However, before the bid may be received by the system, the individual bidder may be asked to confirm his bid through screen 600 of FIG. 6.

Smart Bid button 545 provides another way for the potential buyer to place a bid on the item(s) being auctioned. Smart Bid button 545 may give the potential buyer the option of placing a bid that the system determines while bidding is taking place and may be particularly useful when the current highest bid is nearing the maximum amount the potential buyer may be willing to pay for the item(s) or when there may not be enough time for the potential buyer to successfully enter his desired bid on the item(s).

More specifically, when the Smart Bid button is pressed, the system may enter a bid on behalf of the potential buyer that is higher than the sum of the minimum acceptable incremental bid and the current highest bid, without exceeding the maximum amount the potential buyer is willing to pay for the item. The bid entered by the system on behalf of the user may be based on bids entered by other potential buyers, the current highest bid, the minimum acceptable incremental bid and/or the maximum amount authorized by the bidder. In a preferred embodiment, when the Smart Bid button is pressed, the potential buyer may be prompted to enter the maximum amount he is willing to pay and the system may then calculate and enter an appropriate bid by multiplying the minimum acceptable incremental bid by a variable factor, and adding the result to the current highest bid. The factor may be chosen based on the improvement level, as described above.

For example, if the current bid is $80, the minimum acceptable incremental bid is $5 and the maximum amount a first bidder—bidder A—is willing to pay is $100, the Smart Bid option may allow a bid for $90 to be entered on behalf of bidder A. If bidder A had entered a bid for $85, another bidder—bidder B—may enter a bid for $90, which would still allow bidder A to enter a bid for $100 under the Smart Bid option. However, if bidder A enters a bid for $95 instead, then bidder B may enter a bid for $100, thereby preventing bidder A from entering the amount he was willing to pay for the item being auctioned. The Smart Bid option may therefore be implemented in such a way that ensures that a bid for $100 for the item is ultimately entered on behalf of bidder A as a valid bid.

Screen 600 of FIG. 6 may be displayed to the particular bidder after he enters his bid. Screen 600 may include some of the elements of screen 500. In addition, screen 600 includes window 638 and buttons 610 and 620. Bid spotter 533 may be adapted to ask the bidder to confirm whether the bid he entered is correct through the announcement made in window 638. The bidder may confirm his bid by pressing Yes button 610 or may cancel his bid by pressing No button 620. If the buyer presses Yes button 610, then his bid may be received at step 406 of FIG. 4.

After step 406, process 400 may determine whether a new highest bid was established at step 408, and if so, continues to step 410. A bidder may be allowed to retract his bid. The bidder may do so by pressing on Retract button 546 of FIG. 5 before the bidding period expires. In such an event, process 400 of FIG. 4 may have to recalculate the new highest current bid without reviving the previous highest current bid.

At step 410 of FIG. 4, auctioneer 522 of FIG. 5 may announce to all participants the current highest bid, while region 512 may be updated to reflect it. As mentioned above, the minimum acceptable incremental bid may be a function of the current highest bid or may be fixed at or before the beginning of the auction process. In either case, the minimum acceptable incremental bid may also be announced by auctioneer 522 at step 410 of FIG. 4. Auctioneer 522 may or may not announce the identity of the participant who placed the highest bid, depending on the rules applicable to the particular auction. In the event that the highest bid is an advance bid, an email may be automatically sent to the bidder who placed the bid. After step 410, process 400 may go back to step 404 where the bidding period may be recalculated based on the current highest bid and the amount of bidding activity. In addition, the timer may be reset for counting down the newly calculated bidding period at step 404.

In an alternative embodiment, process 400 need not recalculate the bidding period at step 404 and may reset the timer according to the previously calculated bidding period at step 404. In yet another alternative embodiment, the bidding period may be chosen to be a fixed time period throughout the entire auction process and need not be calculated at step 404.

After undergoing step 404 again, process 400 may solicit bids at step 406 by causing bid spotter 533 of FIG. 5 to address a participant who had previously placed a bid on the item. Bid spotter 533 may be adapted to ask the participant whether he wants to raise his bid or may suggest an amount based on the minimum acceptable incremental bid. The participant may select the amount suggested by pressing on Bid button 544 and may be asked to confirm his bid through screen 600, as described in connection with FIG. 6.

The exemplary screen 500 shown in FIG. 5 depicts an acoustic guitar, shown in window 504, being auctioned. In this example, the auctioneer 522 is announcing that the current highest bid for the guitar is $250.00, which is also reflected in region 512. It can be deduced from regions 516 and 502 that the auction started on Saturday April 5, at 1:00 pm and has been ongoing for 15 minutes. Bid spotter 533 is soliciting the participant to bid by making the announcement displayed in region 538. Exemplary screen 500 may be what is displayed to a participant at step 406 of FIG. 4.

The exemplary screen 600 shown in FIG. 6 depicts bid spotter 533 requesting that the bidder confirm his bid in window 638. In this example, the bidder is assumed to have entered a $260 bid for the acoustic guitar shown in window 504 after exemplary screen 500 of FIG. 5 was displayed to him. Exemplary screen 600 may be what is displayed to a participant at step 406 of FIG. 4, after the participant places a bid.

Referring to FIG. 4, in the event that no bids have been entered or accepted at step 408, process 400 may determine whether the bidding period has passed at step 412 by consulting the timer set at step 404. If the bidding period has not passed, process 400 may go back to step 406 and new bids may be solicited by bid spotter 533 of FIG. 5. Bid spotter 533 may solicit bids more aggressively from bidders who have made previous bids on the same item or a related item. Bid spotter 533 may also solicit bids from bidders who have bought several related items through the auction site.

In the event that the bidding period has passed without new bids having been accepted at step 412 of FIG. 4, process 400 may continue to step 413. At step 413, process 400 determines whether any bids have been accepted by the auction system. If no bids have been accepted, then process 400 ends at step 422. In that case, auctioneer 522 of FIG. 5 may announce the end of the auction and indicate that there were no successful bids on the item to the participants who may have entered into the auction. Auctioneer 522 may therefore announce “Item Withdrawn”.

In the event that the seller has entered a reserve price at step 212 of FIG. 2, process 400 of FIG. 4 may determine whether the reserve price has been met at step 413. If the reserve price has been met, then process 400 may continue to step 414, otherwise, process 400 may terminate at step 422. In the latter case, auctioneer 522 of FIG. 5 may announce the end of the auction to the participants, indicating that the item has been withdrawn or that the reserve price has not been met.

Referring to FIG. 4, if there has been at least one accepted bid, process 400 goes from step 413 to step 414. At step 414, process 400 may determine whether announcement “Going Once” has been made since the timer was last set or reset at step 404. If such an announcement has not been made, then process 400 may instruct auctioneer 522 of FIG. 5 to announce “Going Once” and to raise hammer 526 as an indication to participants that bidding may be coming close to an end at step 416 of FIG. 4. Referring back to step 414 of FIG. 4, if announcement “Going Once” has been made, process 400 may determine at step 418 whether announcement “Going Twice” has been made since the timer was last set or reset at step 404. If such an announcement has been made, then process 400 may instruct auctioneer 522 of FIG. 5 to announce “Sold” and process 400 may end at step 422, thereby closing the auction. If such an announcement has not been made, then process 400 may instruct auctioneer 522 of FIG. 5 to announce “Going Twice” and to raise hammer 526 as another indication to participants that bidding may be coming close to an end at step 420 of FIG. 4.

After announcement “Going Once” is made at step 416, process 400 may go back to step 404. Alternatively, after announcement “Going Twice” is made at step 420, process 400 may go back to step 404. Further to what was described above in relation to step 404, the bidding period may then be recalculated based on the current highest bid, the amount of bidding activity, and whether announcement “Going Once” or “Going Twice” has been made. In addition, the timer may be reset for counting down the newly calculated bidding period at step 404. Again, the bidding period need not be recalculated at step 404 and may be based on the previously determined bidding period. Process 400 may step through steps 406 and 408 again in order to receive bids and determine whether a new current highest bid is accepted. Process 400 may solicit bids at step 406 by causing bid spotter 533 of FIG. 5 to ask the participant who previously submitted a potentially winning bid whether he wants to raise his bid. Bid spotter 533 may encourage that participant to place another bid in region 538, or may suggest an amount which the participant may select by pressing Bid button 544 and confirming his bid through screen 600, as described in connection with FIG. 6.

As can be understood, process 400 of FIG. 4 establishes the logic that may control the flow of the auction. During that process, auctioneer 522 of FIG. 5 may continue to announce bids at step 410 of FIG. 4 while bid spotter 533 of FIG. 5 solicits further bids at step 406 of FIG. 4. When bidding appears to have stopped by virtue of the fact that there have been no new bids for a pre-determined amount of time calculated and updated at step 404 of FIG. 4, auctioneer 522 of FIG. 5 may announce “Going Once” at step 416 of FIG. 4 to see if any new bids are placed. If no new bids are placed within a pre-determined time period calculated at step 404 of FIG. 4, auctioneer 522 of FIG. 5 may announce “Going Twice” at step 420 of FIG. 4. During the periods after the “Going Once” and “Going Twice” announcements, bid spotter 533 of FIG. 5 may again solicit bids from individuals who bid earlier at step 406 of FIG. 4. If new bids are placed following the announcement of “Going Once” or “Going Twice,” the auction resumes as before. If there are no further bids for a pre-determined time period calculated at step 404 and following the announcement of “Going Twice,” auctioneer 522 of FIG. 5 may be adapted to bang gavel or hammer 526 on table 524 and announce “Sold,” signaling the end of the auction at step 422 of FIG. 4.

FIG. 9 illustrates an alternative process 900 that may be implemented instead of process 400 of FIG. 4. Process 900 establishes another logic that may control the flow of the auction. Much like in process 400, auctioneer 522 of FIG. 5 may continue to announce bids at step 410 of process 900 while bid spotter 533 of FIG. 5 solicits further bids at step 406 of process 900. When bidding appears to have stopped by virtue of the fact that there have been no new bids for a pre-determined amount of time calculated and updated at step 404 of process 900, auctioneer 522 of FIG. 5 may announce “Last Chance to Bid” at step 916 of FIG. 4. This announcement may be made after determining that it was not previously made within the same pre-determined amount of time at step 914 of process 900. Process 900 of FIG. 9 resumes as process 400 of FIG. 4 does in the event that other bids have been placed after the “Last Chance to Bid” announcement. If there are no further bids for a pre-determined time period calculated at step 404 of process 900 and following the “Last Chance to Bid” announcement, auctioneer 522 of FIG. 5 may be adapted to bang gavel or hammer 526 on table 524 and announce “Sold,” signaling the end of the auction at step 422 of process 900.

Whether or not there were any bids accepted in process 900 of FIG. 9, auctioneer 522 of FIG. 5 announces “Last Chance to Bid” and bid spotter 533 of FIG. 5 may solicit bids from participants. In the event that the seller has entered a reserve price at step 212 of FIG. 2, process 900 of FIG. 9 may determine whether the reserve price was met prior to step 422. If the reserve price has been met, then auctioneer 522 of FIG. 5 may announce “Sold” at step 422 of FIG. 9. Otherwise, auctioneer 522 of FIG. 5 may announce that the item has been withdrawn, or indicate that the reserve price has not been met.

FIGS. 7 and 8 illustrate exemplary screens 700 and 800 that the auction system may display to the winning bidder upon close of the auction on workstation 110 of FIG. 1. Screens 700 and 800 may be displayed in the event that the reserve price (if any) has been met and in case the auction has not ended because no bids were accepted. Screens 700 and 800 may include an animated character in the form of another auction attendant 744 that may appear once the auction is concluded. Auction attendant 744 is automated and controlled by the controlling logic of system 100 depicted in FIG. 1. An auction attendant in the form of the character 744 may be the default character that is displayed to the buyer. Alternatively, the auction attendant that may be displayed to the winning bidder may be any animated character that system 100 may generate based on the buyer's preferences, profile or on the item sold. Auction attendant 744 may give the winning bidder instructions on how to proceed with payment. These instructions may be heard through the winning bidder's workstation speakers and may be displayed to that bidder in region 738 of FIG. 7 or in region 838 of FIG. 8.

Screen 700 of FIG. 7 may include window 720 which may present the winning bidder or buyer numerous payment options. In exemplary screen 700, such options include money order, wire transfer, check or credit card payment, depending on the seller's preferences. The buyer may choose among these options by clicking on the appropriate portion of window 720 and may also specify the shipping method for the item by typing it in when prompted for it.

The auction host operating the auction site may act as escrow agent, thereby serving as a counterparty between the buyer and the seller. In this case, once the buyer enters the required information, an email message may be automatically sent to the seller, informing her that the auction has ended and notifying her of the winning bid price, the payment mechanism and the shipping method. Auction attendant 744 may then thank the buyer for using the auction site. Afterwards, the seller may be directed via email to a homepage where she may enter the total balance due. After the seller completes the required fields, the buyer may be notified of that amount via email. When payment in available funds is received by the auction host, the seller may ship the item to the buyer. Following receipt of the goods in satisfactory condition by the buyer, or the expiration of a pre-determined period during which the buyer may object, the auction host may release the funds to the seller.

The exemplary screen 700 shown in FIG. 7 displays window 750 congratulating the winning bidder and indicating that the winning bid for the single acoustic guitar displayed is $300.00, as can be seen in regions 712 and 714 of window 710. In this example, the auction is shown to have ended on Saturday April 5 at 1:22 pm, which is 22 minutes into the auction, as can be deduced from regions 716 and 702. Exemplary screen 700 may be displayed to a buyer whose payment and shipping information is not stored in the system.

Screen 800 of FIG. 8 may be displayed to the winning bidder once he has chosen a method of payment in accordance with the instructions of screen 700 of FIG. 7. Alternatively, screen 800 may be displayed instead of screen 700 after the auction has ended to a participant whose payment preferences and shipping information are stored in the system. Screen 800 may contain the same elements of screen 700 of FIG. 7, with the exception of windows 820, 830, 840 and region 838. Auction attendant 744 may ask the winning bidder to confirm his payment information in region 838. The bidder's preferred payment method and information may be retrieved from the system memory and displayed to him in window 820. For example, in exemplary screen 800, the user's preferred payment method is via credit card and his shipping address is as shown. If the bidder is satisfied with the information, he may select the payment method displayed to him by pressing Confirm button 830. Otherwise, he may edit one or more fields in window 820 or select another method of payment by pressing on button Change Method Of Payment 840.

Exemplary screens 700 and 800 of FIGS. 7 and 8 may be displayed to a participant when the auction host serves as a counterparty between the buyer and seller. Alternatively, settlement of the auction may be done by name give-up. In such a scheme, auction attendant 744 may inform the buyer of the seller's identity in region 738 of FIG. 7 or region 838 of FIG. 8. The seller may also be notified of the buyer's identity via an automated email sent after the conclusion of the auction. The seller and buyer may then consummate the transaction themselves.

Upon conclusion of an auction, system 100 of FIG. 1 may be automatically adapted to search for items pertaining to the same specific category as the item purchased by the buyer. Such a search may be conducted as shown and described in connection with step 218 of FIG. 2. The search results may be displayed to the winning bidder, to a bidder who attempted to bid on the item that was won by the winning bidder, and/or to participants who have not entered any bids on the item. The system may then be adapted to step through steps 220 and 224 as described in connection with process 200 of FIG. 2 and prompt the participant as to whether he would want to enter or be taken to a different available auction on a similar or related item.

Whether or not there are similar items being auctioned, system 100 of FIG. 1 may be adapted to update the profiles of each bidder and participant by noting that such individuals demonstrated interest in a particular type of item by entering into an auction on a specific item. This may enable system 100 to alert these users via email when another auction on the same or a similar item may be created in the future. A user may choose to disable such an option in order for him not to receive future emails relating to the auctioning of related items.

One of ordinary skill in the art should appreciate that portions of the present invention may be practiced by means other than the ones described herein. For example, a potential seller may post an item for sale via email, while potential buyers may bid on auctioned items via email. Such an embodiment still makes use of the Internet. The auction site need not be hosted on the Internet's World Wide Web, however, and may be implemented on a WAN, LAN or DSL network instead. Alternatively, the seller may contact the auction site via telephone to enter information regarding an item she may wish to sell. Although some of the methods of practicing the present invention disclosed herein may-require the assistance of a person in setting up different aspects of the auction, the nature of the auction process described in connection with FIGS. 4 and 9 need not lose its automated character.

Finally, one of ordinary skill in the art should appreciate that the present invention may be practiced in embodiments other than those illustrated herein without departing from the spirit and scope of the invention, and that the invention is only limited by the claims which follow. 

1. An apparatus for implementing an automated auction process, the apparatus comprising: a processor; and a memory operable to: store a profile associated with a first user; store data regarding a plurality of animated characters; and store a program for controlling the processor; the processor communicatively coupled to the memory and to a plurality of workstations, wherein a first workstation is associated with a first user, and wherein the program controls the processor to: determine a first animated character; receive a first bid for an item from a workstation associated with a user; cause the first workstation to display the first animated character as an animated auctioneer that announces the first bid for the item; receive a second bid for the item from a workstation associated with another user; determine that the second bid is a current highest bid for the item; cause the animated auctioneer to announce the second bid for the item based at least in part on determining that the second bid is the current highest bid for the item; determine that a subsequent bid for the item has not been received within a first pre-determined time period after announcing the current highest bid; cause the animated auctioneer to make a first announcement regarding termination of bidding based at least in part on the determination; and cause the first workstation to display a second animated character as an animated bid spotter that solicits bids from the first user after the first announcement.
 2. The apparatus of claim 1 wherein the workstation processor of at least one of the plurality of workstations is adapted to receive product information on the at least one item and to display the product information.
 3. The apparatus of claim 2 wherein the product information comprises a description of the at least one item.
 4. The apparatus of claim 2 wherein the product information comprises a photograph of the at least one item.
 5. The apparatus of claim 2 wherein the product information comprises a video presentation of the at least one item.
 6. The apparatus of claim 2 wherein the product information comprises the number of units available for sale of the at least one item.
 7. The apparatus of claim 1 wherein the workstation processor of at least one of the plurality of workstations is adapted to receive sale information on the at least one item.
 8. The apparatus of claim 7 wherein the sale information comprises a reserve price for the at least one item.
 9. The apparatus of claim 7 wherein the sale information comprises at least one of the group of parameters consisting of a preferred auction duration and a preferred auction commencement time.
 10. The apparatus of claim 7 wherein the sale information comprises a preferred method of payment.
 11. The apparatus of claim 1 wherein the server processor is adapted to conduct a search for an item related to the at least one item and display search results on the workstation display of at least one of the plurality of workstations.
 12. The apparatus of claim 1 wherein the server processor is adapted to conduct a search for an item related to items in which a user has demonstrated interest and display search results on the workstation display of at least one of the plurality of workstations.
 13. The apparatus of claim 12 wherein the server processor is adapted to allow the user to enter an auction on the related item.
 14. The apparatus of claim 1 wherein the server processor is adapted to determine an auction commencement time and a minimum acceptable opening bid for the at least one item.
 15. The apparatus of claim 14 wherein the pre-determined time period may be calculated based on at least one of the group of parameters consisting of the nature of the at least one item, the expected selling price of the at least one item, and the minimum acceptable opening bid.
 16. The apparatus of claim 14 wherein the workstation processor of at least one of the plurality of workstations is adapted to display the auction commencement time and the minimum acceptable opening bid.
 17. The apparatus of claim 16 wherein the animated auctioneer is adapted to announce the minimum acceptable opening bid at the auction commencement time.
 18. The apparatus of claim 1 wherein the server processor is adapted to select the animated auctioneer from a set of genre-based characters.
 19. The apparatus of claim 1 wherein the processor is further operable to: determine a second animated character, from the plurality of animated characters, based at least in part on the profile associated with the first user; and cause the first workstation to display the second animated character as the animated bid spotter that announces, during the auction, at least one message for soliciting bids from the first user.
 20. The apparatus of claim 19 wherein the animated bid spotter seeks confirmation from the first user for a bid placed by the first user.
 21. The apparatus of claim 20 wherein the animated bid spotter announces to the first user the bid placed by the first user.
 22. The apparatus of claim 1 wherein: a second workstation is associated with a second user; the memory is further operable to store a profile associated with the second user; and the processor is further operable to: determine a second animated character, from the plurality of animated characters, based at least in part on the profile associated with the second user; and cause the second workstation to display the second animated character as an animated auctioneer that announces the current highest bid.
 23. The apparatus of claim 1 wherein the workstation processor of at least one of the plurality of workstations is operative with the workstation program to display a first animated auction attendant that is adapted to welcome a potential bidder to the auction process.
 24. The apparatus of claim 23 wherein the server processor is adapted to select the first animated auction attendant from a set of genre-based characters.
 25. The apparatus of claim 23 wherein the workstation processor of at least one of the plurality of workstations is operative with the workstation program to display a second animated auction attendant to a winning bidder.
 26. The apparatus of claim 25 wherein the server processor is adapted to select the second animated auction attendant from a set of genre-based characters.
 27. The apparatus of claim 25 wherein the second animated auction attendant is adapted to instruct the winning bidder to choose a method of payment for the at least one item.
 28. The apparatus of claim 27 wherein the second animated auction attendant is adapted to ask the winning bidder to confirm the chosen method of payment.
 29. The apparatus of claim 25 wherein the server storage device is adapted to store preferred payment and shipping information pertaining to the winning bidder, the second animated auction attendant being adapted to display and ask the winning bidder to confirm the preferred payment and shipping information.
 30. The apparatus of claim 1 wherein the bids received on the at least one item comprise advance bids.
 31. The apparatus of claim 1 wherein at least one of the bids received on the at least one item comprises a Smart Bid.
 32. The apparatus of claim 31 wherein the Smart Bid is calculated by the server processor to be higher than the sum of a minimum acceptable incremental bid and the current bid in order to insure that a bidder is given the opportunity to place a bid corresponding to the maximum amount the bidder is willing to place.
 33. The apparatus of claim 1 wherein the pre-determined time period may be updated based on at least one of the group of parameters consisting of the pre-determined time period, the current bid, and the number of received bids.
 34. The apparatus of claim 1 wherein each of the plurality of animated characters represents a respective celebrity.
 35. The apparatus of claim 1 wherein the profile associated with the first user comprises one or more buyer preferences associated with the first user.
 36. The apparatus of claim 1 the processor further operable to: make a second determination that a subsequent bid for the item has not been received within a second pre-determined time period after the first announcement; and cause the animated auctioneer to make a second announcement regarding termination of bidding based at least in part on the second determination.
 37. The apparatus of claim 36 wherein the second pre-determined time period is calculated based on the first pre-determined time period.
 38. The apparatus of claim 36 wherein the second pre-determined time period is equal to the first pre-determined time period.
 39. The apparatus of claim 36 the processor further operable to: make a third determination that a subsequent bid for the item has not been received within a third pre-determined time period after the second announcement; and cause the animated auctioneer to make a third announcement regarding termination of bidding based at least in part on the third determination.
 40. The apparatus of claim 39 wherein the third announcement comprises a “Sold” announcement.
 41. The apparatus of claim 36 wherein the second announcement comprises a “Going Twice” announcement.
 42. The apparatus of claim 36 wherein the second announcement comprises a “Sold” announcement.
 43. The apparatus of claim 1 wherein the first announcement comprises a “Last Chance to Bid” announcement.
 44. The apparatus of claim 1 wherein the first announcement comprises a “Going Once” announcement.
 45. The apparatus of claim 1 wherein the processor and the plurality of workstations are connected through the Internet.
 46. A method for implementing an automated auction process, the method comprising: storing a profile associated with a first user; storing data regarding a plurality of animated characters; causing a plurality of workstations to display information regarding at least one item, wherein a first workstation is associated with the first user; determining a first animated character; receiving, from at least one workstation associated with a user, a first bid on the at least one item from; causing the first workstation to display the first animated character as an animated auctioneer that announces the first bid for the at least one item; receiving, from at least one workstation associated with another user, a second bid on the at least one item; determining that the second bid is a current highest bid on the at least one item based at least in part on the at least one bid; causing the animated auctioneer to announce the second bid for the at least one item based at least in part on determining that the second bid is a current highest bid for the at least one item; determining that a subsequent bid is not received from at least one workstation within a first pre-determined time period after announcing the current highest bid; causing the animated auctioneer to make a first announcement regarding termination of bidding based at least in part on the determination; and causing the first workstation to display a second animated character as an animated bid spotter that solicits one or more bids on the at least one item after the first announcement.
 47. The method of claim 46 wherein the displaying product information relating to the at least one item comprises displaying a description of the at least one item.
 48. The method of claim 46 wherein the displaying product information relating to the at least one item comprises displaying a photograph of the at least one item.
 49. The method of claim 46 wherein the displaying product information relating to the at least one item comprises displaying a video presentation of the at least one item.
 50. The method of claim 46 wherein the displaying product information relating to the at least one item comprises displaying the number of units available for sale of the at least one item.
 51. The method of claim 46 further comprising receiving sale information on the at least one item prior to the displaying the animated auctioneer.
 52. The method of claim 51 wherein the receiving sale information on the at least one item comprises receiving a reserve price for the at least one item.
 53. The method of claim 51 wherein the receiving sale information on the at least one item comprises receiving at least one of the group of parameters consisting of a preferred auction duration and a preferred auction commencement time.
 54. The method of claim 51 wherein the receiving sale information on the at least one item comprises receiving a preferred method of payment.
 55. The method of claim 51 further comprising prompting a user intending to sell the at least one item for a username and a password prior to the receiving sale information on the at least one item.
 56. The method of claim 46 further comprising conducting a search for an item related to the at least one item and displaying search results relating to the search.
 57. The method of claim 46 further comprising conducting a search for an item related to items in which a user has demonstrated interest and displaying search results relating to the search.
 58. The method of claim 57 further comprising allowing the user to enter an auction on the related item.
 59. The method of claim 46 further comprising setting an auction commencement time for the at least one item prior to the displaying the animated auctioneer.
 60. The method of claim 46 further comprising setting a minimum acceptable opening bid for the at least one item prior to the displaying the animated auctioneer.
 61. The method of claim 60 wherein the animated auctioneer announcing the start of the auction process comprises the animated auctioneer announcing the minimum acceptable opening bid.
 62. The method of claim 60 wherein the setting a pre-determined time period comprises calculating the pre-determined time period based on at least one of the group of parameters consisting of the nature of the at least one item, the expected selling price of the at least one item, and the minimum acceptable opening bid.
 63. The method of claim 46 further comprising setting a minimum acceptable incremental bid for the at least one item.
 64. The method of claim 63 wherein the animated auctioneer announcing the start of the auction process comprises the animated auctioneer announcing the minimum acceptable incremental bid.
 65. The method of claim 63 wherein the receiving at least one bid on the at least one item comprises receiving a plurality of bids on the at least one item during the pre-determined time period.
 66. The method of claim 65 wherein the determining a current bid on the at least one item comprises comparing each of the plurality of bids on the at least one item with the sum of the minimum acceptable incremental bid and a most recent current bid.
 67. The method of claim 66 wherein the determining a current bid on the at least one item further comprises prioritizing the plurality of bids on the at least one item based on the time each of the plurality of bids is received.
 68. The method of claim 67 wherein the determining a current bid on the at least one item further comprises determining an updated highest bid among the prioritized plurality of bids on the at least one item.
 69. The method of claim 65 wherein the setting a pre-determined time period comprises updating the pre-determined time period based on at least one of the group of parameters consisting of the predetermined time period, the current bid, and the number of the plurality of bids received on the at least one item.
 70. The method of claim 46 wherein the displaying an animated auctioneer on the interactive screen comprises selecting the animated auctioneer from a set of genre-based characters.
 71. The method of claim 46 wherein the receiving at least one bid on the at least one item comprises receiving an advance bid on the at least one item.
 72. The method of claim 46 wherein the receiving at least one bid on the at least one item comprises receiving a Smart Bid on the at least one item.
 73. The method of claim 72 wherein the receiving the Smart Bid comprises calculating the at least one bid to be higher than the sum of a minimum acceptable incremental bid and the current bid in order to insure that a bidder is given the opportunity to place a bid corresponding to the maximum amount the bidder is willing to place.
 74. The method of claim 46 wherein the at least one workstation is associated with a particular user, and further comprising allowing the particular user to retract the at least one bid within a pre-determined time period after the announcement of the current bid.
 75. The method of claim 46 further comprising: determining a second animated character, from the plurality of animated characters, based at least in part on the profile associated with the first user; and causing the first workstation to display the second animated character as the animated bid spotter that solicits bids on the at least one item from the first user.
 76. The method of claim 75 wherein the animated bid spotter seeks confirmation from the first user for a bid placed by the first user.
 77. The method of claim 76 wherein the animated bid spotter announces to the first user the bid placed by the first user.
 78. The method of claim 46 wherein a second workstation is associated with a second user, the method further comprising: storing a profile associated with the second user; determining a second animated character, from the plurality of animated characters, based at least in part on the profile associated with the second user; and causing the second workstation to display the second animated character as an animated auctioneer that announces the current highest bid.
 79. The method of claim 46 wherein the interactive screen is a first interactive screen, the method further comprising displaying a first animated auction attendant on a second interactive screen, the first animated auction attendant for welcoming a potential bidder to the automated auction process.
 80. The method of claim 79 wherein the displaying a first animated auction attendant comprises selecting the first animated auction attendant from a set of genre-based characters.
 81. The method of claim 79 further comprising displaying a second animated auction attendant on a third interactive screen to a winning bidder.
 82. The method of claim 81 wherein the displaying a second animated auction attendant comprises selecting the second animated auction attendant from a set of genre-based characters.
 83. The method of claim 81 wherein the displaying a second animated auction attendant comprises displaying a second animated auction attendant for instructing the winning bidder to choose a method of payment for the at least one item.
 84. The method of claim 83 wherein the displaying a second animated auction attendant further comprises displaying the second animated auction attendant for asking the winning bidder to confirm the chosen method of payment for the at least one item.
 85. The method of claim 81 further comprising storing a preferred method of payment pertaining to the winning bidder, the displaying a second animated auction attendant further comprises displaying the second animated auction attendant for asking the winning bidder to confirm the preferred method of payment for the at least one item.
 86. The method of claim 46 wherein each of the plurality of animated characters represents a respective celebrity.
 87. The method of claim 46 wherein the profile associated with the first user comprises one or more buyer preferences associated with the first user.
 88. The method of claim 46, further comprising: making a second determination that a subsequent bid is not received from at least one workstation within a second pre-determined time period after the first announcement; and causing the animated auctioneer to make a second announcement regarding termination of bidding based at least in part on the second determination.
 89. The method of claim 88 wherein the second pre-determined time period is calculated based on the first predetermined time period.
 90. The method of claim 88 wherein the second pre-determined time period is equal to the first pre-determined time period.
 91. The method of claim 88 further comprising: making a third determination that a subsequent bid is not received within a third pre-determined time period after the second announcement; and causing the animated auctioneer to make a third announcement regarding termination of bidding based at least in part on the third determination.
 92. The method of claim 91 wherein the animated auctioneer making the third announcement comprises the animated auctioneer announcing “Sold”.
 93. The method of claim 88 wherein the animated auctioneer making the second announcement comprises the animated auctioneer announcing “Going Twice”.
 94. The method of claim 88 wherein the animated auctioneer making the second announcement comprises the animated auctioneer announcing “Sold”.
 95. The method of claim 46 wherein the animated auctioneer making the first announcement comprises the animated auctioneer announcing “Last Chance to Bid”.
 96. The method of claim 46 wherein the animated auctioneer making the first announcement comprises the animated auctioneer announcing “Going Once”.
 97. The method of claim 46 further comprising causing the first workstation to prompt the first user for a usemame and a password.
 98. The method of claim 46 wherein the winning bid is determined by a server that is communicatively coupled to the plurality of workstations via one or more networks comprising the Internet. 